Compiling CSP
نویسنده
چکیده
CSP, Hoare’s Communicating Sequential Processes, is a formal language for specifying, implementing and reasoning about concurrent processes and their interactions. Existing software tools that deal with CSP directly are largely concerned with assisting formal proofs. This paper presents an alternative use for CSP, namely the compilation of CSP systems to executable code. The main motivation for this work is in providing a means to experiment with relatively large CSP systems, possibly consisting millions of concurrent processes — something that is hard to achieve with the tools currently available.
منابع مشابه
Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
In this project we present, the tree-of-BDDs approach, a decomposition scheme for compiling configuration problems. We also present efficient techniques for generating minimum explanations in the BDD-based configuration schemes. Given a BDD representing the solutions of a CSP, an efficient technique for detecting full interchangeable values is given. Experimental results show that the technique...
متن کاملCompiling shared variable programs into CSP
We present a compiler from a simple shared variable language into CSP. This allows the application of CSP-based tools such as FDR when analysing programs written in the other language. The translation into CSP makes it easy to be flexible about the semantics of execution, most particularly the amount of atomicity that is enforced. We examine ways available to translate specifications we may wis...
متن کاملPlanning as constraint satisfaction: Solving the planning graph by compiling it into CSP
The idea of synthesizing bounded length plans by compiling planning problems into a combinatorial substrate, and solving the resulting encodings has become quite popular in recent years. Most work to-date has however concentrated on compilation to satis ability (SAT) theories and integer linear programming (ILP). In this paper we will show that CSP is a better substrate for the compilation appr...
متن کاملSolving Planning-Graph by Compiling It into CSP
Although the deep affinity between Graphplan’s backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan’s planning graph into a CSP...
متن کاملCompiling Planning into Scheduling: A Sketch
Although there are many approaches for compiling a planning problem into a static CSP or a scheduling problem, current approaches essentially preserve the structure of the planning problem in the encoding. In this paper we present a fundamentally different encoding that more accurately resembles a scheduling problem. We sketch the approach and argue, based on an example, that it is possible to ...
متن کامل